Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2007, Vol. 30 ›› Issue (2): 63-66.doi: 10.13190/jbupt.200702.63.zhouw

• Papers • Previous Articles     Next Articles

An Efficient Decoding Algorithm for Finite-Geometry Low-Density Parity-Check Codes

ZHOU Wei, MEN Ai-dong, ZHAO Li-ye, QUAN Zi-yi   

  1. (School of Telecommunication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China )
  • Received:2006-04-06 Revised:1900-01-01 Online:2007-04-30 Published:2007-04-30
  • Contact: ZHOU Wei

Abstract:

Based on decoding performance, complexity and latency of finite-geometry low-density parity-check (FG-LDPC) codes, an efficient decoding algorithm was proposed. The new algorithm is a hybrid bit-flipping (BF)/majority-logic (MLG) decoding scheme. In BF decoding, an efficient method was explored to measure the reliability of the checks. At the completion of a small number of iterations, the output from BF decoding is decoded by MLG decoding. In the hybrid algorithm, there are no float operations. Simulation results show that the hybrid algorithm can provide 0.3 dB coding gain over weight bit-flipping (WBF) decoding.

Key words: low-density parity-check codes, bit-flipping decoding, majority-logic decoding, sum–product algorithm

CLC Number: